Towards accurate quantum simulations of large systems with small computers

نویسنده

  • Yonggang Yang
چکیده

Numerical simulations are important for many systems. In particular, various standard computer programs have been developed for solving the quantum Schrödinger equations. However, the accuracy of these calculations is limited by computer capabilities. In this work, an iterative method is introduced to enhance the accuracy of these numerical calculations, which is otherwise prohibitive by conventional methods. The method is easily implementable and general for many systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exploring the implications of the laws and principles of quantum physics in the field of talent (quantum theory of talent)

The issue of talent-discovering is one of the most important issues in the field of education and research that has always been a concern for educational systems. Studying the issues of identifying and guiding talented students can illuminate a large part of the activities of the executors and practitioners in order to accomplish their mission effectively. On the other hand, quantum physics has...

متن کامل

Quantum Lattice-Gas Model for the Diffusion Equation

Presented is a factorized quantum lattice-gas algorithm to model the diffusion equation. It is a minimal model with two qubits per node of a one-dimensional lattice and it is suitable for implementation on a large array of small quantum computers interconnected by nearest-neighbor classical communication channels. The quantum lattice-gas system is described at the mesoscopic scale by a lattice-...

متن کامل

Interactive quantum chemistry: A divide-and-conquer ASED-MO method

We present interactive quantum chemistry simulation at the atom superposition and electron delocalization molecular orbital (ASED-MO) level of theory. Our method is based on the divide-and-conquer (D&C) approach, which we show is accurate and efficient for this non-self-consistent semiempirical theory. The method has a linear complexity in the number of atoms, scales well with the number of cor...

متن کامل

Quantum Simulation of Tunneling in Small Systems

A number of quantum algorithms have been performed on small quantum computers; these include Shor's prime factorization algorithm, error correction, Grover's search algorithm and a number of analog and digital quantum simulations. Because of the number of gates and qubits necessary, however, digital quantum particle simulations remain untested. A contributing factor to the system size required ...

متن کامل

Towards Computational Complexity Theory for Quantum Simulation

Computational complexity of quantum simulations by quantum computers is viewed from the viewpoint of computational complexity theory over the reals and solving differential equations, with emphasis on precision of

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2017